Boundary Matching and Interior Connectivity-Based Cluster Validity Anlysis
نویسندگان
چکیده
منابع مشابه
Cluster Validity Through Graph-based Boundary Analysis
Gaining confidence that a clustering algorithm has produced meaningful results and not an accident of its usually heuristic optimization is central to data mining. This is the issue of cluster validity. We propose here a method by which proximity graphs are used to effectively detect border points and measure the margin between clusters. With analysis of boundary situation, we design a framewor...
متن کاملMatching Based Augmentations for Approximating Connectivity Problems
We describe a very simple idea for designing approximation algorithms for connectivity problems: For a spanning tree problem, the idea is to start with the empty set of edges, and add matching paths between pairs of components in the current graph that have desirable properties in terms of the objective function of the spanning tree problem being solved. Such matching augment the solution by re...
متن کاملCluster-based color matching for image retrieval
Color is an important attribute for image matching and retrieval We present a new method for color matching based on a clustering algorithm in the D color space We de ne a new color feature to characterize the color information and a distance measure to compute the color similarity of images We have implemented this technique and tested it for a database of about images The test results show th...
متن کاملThe augmented Zagreb index, vertex connectivity and matching number of graphs
Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.
متن کاملValidity Measure of Cluster Based On the Intra-Cluster and Inter-Cluster Distance
The k-means method has been shown to be effective in producing good clustering results for many practical applications. However, a direct algorithm of k-means method requires time proportional to the product of number of patterns and number of clusters per iteration. This is computationally very expensive especially for large datasets. The main disadvantage of the k-means algorithm is that the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2020
ISSN: 2076-3417
DOI: 10.3390/app10041337